Joy Parr and Jon van der Veen, "Megaprojects," http://megaprojects.fims.uwo.ca/
نویسندگان
چکیده
منابع مشابه
Asymptotics of Classical Spin Networks Stavros Garoufalidis and Roland Van Der Veen
A spin network is a cubic ribbon graph labeled by representations of SU(2). Spin networks are important in various areas of Mathematics (3-dimensional Quantum Topology), Physics (Angular Momentum, Classical and Quantum Gravity) and Chemistry (Atomic Spectroscopy). The evaluation of a spin network is an integer number. The main results of our paper are: (a) an existence theorem for the asymptoti...
متن کاملMultichannel Interference Mitigation Techniques in Radio Astronomy Amir Leshem and Alle-jan Van Der Veen
Radio-astronomical observations are increasingly corrupted by radio frequency interference, and on-line detection and Ðltering algorithms are becoming essential. To facilitate the introduction of such techniques into radio astronomy, we formulate the astronomical problem in an array signal processing language and give an introduction to some elementary algorithms from that Ðeld. We consider two...
متن کاملSpecific and Nonspecific Mechanisms in the Autoimmune Breakdown of Myelin roe I van der veen
The effect of myelin basic protein (MBP) of central nervous tissue onthe protease inhibitors, alpha) antitrypsin (aι AT) and alpha;macroglobulm (агМ) wasstudied (л vitro For this purpose. 2 characteristics of the protease inhibitors were used,viz their pattern after isoelectric focusing and their trypsm-binding capacity Bothfeatures of purified a^AT disappeared in the presence o...
متن کاملA Schur Method for Low-rank Matrix Approximation∗ Alle-jan Van Der Veen
The usual way to compute a low-rank approximant of a matrix H is to take its singular value decomposition (SVD) and truncate it by setting the small singular values equal to 0. However, the SVD is computationally expensive. This paper describes a much simpler generalized Schur-type algorithm to compute similar low-rank approximants. For a given matrix H which has d singular values larger than ε...
متن کاملOn the Euclidean TSP with a permuted Van der Veen matrix
We discuss the problem of recognizing permuted Van der Veen (VdV) matrices. It is well known that the TSP with a VdV matrix as distance matrix is pyramidally solvable. In this note we solve the problem of recognizing permuted strong VdV matrices. This yields an O(n4) time algorithm for the TSP with a permuted Euclidean VdV matrix. The problem, however, of recognizing permuted VdV matrices in ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Left History: An Interdisciplinary Journal of Historical Inquiry and Debate
سال: 2008
ISSN: 1913-9632,1192-1927
DOI: 10.25071/1913-9632.24653